Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org RENT, LEASE OR BUY: RANDOMIZED ALGORITHMS FOR MULTISLOPE SKI RENTAL ZVI LOTKER 1 , BOAZ PATT-SHAMIR 2 , AND DROR RAWITZ

Source URL: drops.dagstuhl.de

Contents Pseudorandomness { Part II Introduction Lecture 1. Deterministic Simulation of Randomized Algorithms 1. Probabilistic Algorithms versus Deterministic Algorithms 2. De-randomization Under Complexity Assumptions

Source URL: www.wisdom.weizmann.ac.il

Advanced Approximation Algorithms (CMU 18-854B, SpringLecture 2: LP Relaxations, Randomized Rounding Jan 17, 2008

Source URL: www.cs.cmu.edu

Linear and Sublinear Linear Algebra Algorithms: Preconditioning Stochastic Gradient Algorithms with Randomized Linear Algebra

Source URL: dimacs.rutgers.edu

Deterministic Sampling Algorithms for Network Design Anke van Zuylen Abstract For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample

Source URL: arvanzuijlen.people.wm.edu

Implementing Randomized Matrix Algorithms in Parallel and Distributed Environments Michael W. Mahoney Stanford University ( For more info, see: http:// cs.stanford.edu/people/mmahoney/

Source URL: mmds-data.org

Competitive Online Algorithms Susanne Albers Overview arrive one by one and must be scheduled immediately

Source URL: www14.in.tum.de

• Online algorithms
• Analysis of algorithms
• Computer science
• Applied mathematics
• Computer programming
• K-server problem
• Metrical task system
• Adversary model
• Competitive analysis
• List update problem
• Algorithm
• Randomized algorithm

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1

Source URL: people.mpi-inf.mpg.de

• Graph theory
• Mathematics
• Computational complexity theory
• NP-hard problems
• NP-complete problems
• Edsger W. Dijkstra
• Combinatorial optimization
• Approximation algorithms
• Travelling salesman problem
• Shortest path problem
• Matching
• Randomized algorithm

Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract The best randomized

Source URL: www14.in.tum.de

• Analysis of algorithms
• Online algorithms
• Finite fields
• Computer science
• Computational complexity theory
• XTR
• List update problem
• Competitive analysis
• Applied mathematics

A Quadratic Regulator-Based Heuristic for Rapidly Exploring State Space Elena Glassman and Russ Tedrake Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of findin

Source URL: eglassman.github.io

• Mathematics
• Search algorithms
• Geometry
• Space
• Metric geometry
• Optimal control
• Mathematical optimization
• Rapidly-exploring random tree
• Robot navigation
• A* search algorithm
• K-nearest neighbors algorithm
• Metric